Excedance Numbers for the Permutations of Type B
نویسنده
چکیده
This work provides a study on the multidistribution of type B excedances, fixed points and cycles on the permutations of type B. We derive the recurrences and closed formulas for the distribution of signed excedances on type B permutations as well as derangements via combinatorial construction. Based on this result, we obtain the recurrence and generating function for the signed excedance polynomial and disclose some relationships with Euler numbers and Springer numbers, respectively.
منابع مشابه
Efficient generating algorithm for permutations with a fixed number of excedances
In this paper, we develop a constant amortized time (CAT) algorithm for generating permutations with a fixed number of excedances. We obtain a Gray code for permutations having one excedance. We also give a bijection between the set of n-length permutations with exactly one excedance and the set Sn(321, 2413, 3412, 21534)\{123 . . . (n− 1)n}. This induces a Gray code for the set Sn(321, 2413, 3...
متن کاملRecursions for Excedance Number in Some Permutations Groups
The excedance number for Sn is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored permutation groups Gr,n. The generalized recursion yields some interesting connection to Stirling numbers of the second kind. We also show some logconcavity resul...
متن کاملExcedances and Descents of Bi-increasing Permutations
Motivated by the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that these (socalled bi-increasing) permutations are just the 321-avoiding ones. The paper investigates their excedance and descent structure. In particular, we give some combinatorial interpretatio...
متن کاملTwo Involutions for Signed Excedance Numbers
Two involutions on permutations and derangements are constructed. They lead to a direct evaluation of some signed Eulerian polynomials on permutations and derangements. The latter formulas, combined with the exponential formula, give a new derivation of the corresponding generating functions.
متن کاملOn the Excedance Sets of Colored Permutations
We define the excedence set and the excedance word on Gr,n, generalizing a work of Ehrenborg and Steingrimsson and use the inclusion-exclusion principle to calculate the number of colored permutations having a prescribed excedance word. We show some symmetric properties as Log concavity and unimodality of a specific sequence of excedance words.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013